Efficient implementation to perform iterative decoding with large iteration counts

ABSTRACT

Systems and methods are presented to improve the performance of a constant bit rate iterative decoder by providing elastic buffering, while utilizing a relatively simple decoder architecture capable of maintaining a fixed number of iterations of a lower value. An LDPC decoder can be designed, for example, to support less than the maximum possible number of iterations, and can, for example, be mated to elastic input and output buffers. If a given code block, or succession of code blocks, requires the maximum number of iterations for decoding, the decoder can, for example, run at such maximum number of iterations and the elastic input buffer can, for example, hold code blocks waiting to be processed so as to maintain a constant input rate. Alternatively, if one or more code blocks requires less than the nominal number of iterations, the output buffer can store those code blocks so as to preserve a constant output rate. It is emphasized that this abstract is provided to comply with the rules requiring an abstract, and is submitted with the understanding that it will not be used to interpret or limit the scope or the meaning of the claims.

CROSS-REFERENCE TO OTHER APPLICATIONS

This application claims the benefit of and incorporates by referenceU.S. Provisional Patent Application No. 60/920,919, entitled “EFFICIENTIMPLEMENTATION TO PERFORM ITERATIVE DECODING WITH LARGE ITERATIONCOUNTS,” filed on Mar. 29, 2007.

TECHNICAL FIELD

The present invention relates to systems and methods for implementingiterative error-correcting codes, and more particularly to systems andmethods to improve the performance of a constant bit rate iterativedecoder.

BACKGROUND INFORMATION

Low Density Parity Check (“LDPC”) codes, originally invented in 1962 byGallagher, have recently been utilized in various communicationsapplications. Because LDPC codes are based on an iterative decodingscheme, the performance of an LPDC decoder is highly dependent upon thenumber of iterations available to properly decode the information. Underpoor signal conditions, a decode instance can consume hundreds ofiterations and still be on the road to convergence. As a matter ofimplementation, designing decoder architectures capable of achievinglarge iteration counts can be quite difficult. Systems with large blocksizes and/or high data rates can further exacerbate the problem, placinga physical limit on the number of iterations that can be performedbetween code blocks. However, some systems may not require that aconsistently large number of iterations be available for each codeblock. Nominally, these systems could be expected to converge in a muchshorter number of cycles, and may only require additional iterations atsporadic instances. Decoder design could be made simpler for suchsystems provided that such design could also adequately support sporadicdemands (which at some times are sustained over multiple code blocks)for high iteration counts.

What is thus needed in the art are systems and methods that can supporta large number of iterations for decoding when necessary, but that alsoavoid a complex decoder design.

SUMMARY

Systems and methods are presented to improve the performance of aconstant bit rate iterative decoder by supporting a large number ofdecoding iterations at needed instances through elastic buffering, whileutilizing a relatively simple decoder architecture capable ofmaintaining a fixed number of iterations of a lower value. In exemplaryembodiments of the present invention, an LDPC decoder can be designed,for example, to support less than the maximum possible number ofiterations, and can be, for example, mated to elastic input and outputbuffers. If a given code block, or succession of code blocks, requires,for example, a maximum number of iterations for decoding, the decodercan, for example, run at such maximum number of iterations and theelastic input buffer can, for example, hold code blocks waiting to beprocessed so as to maintain a constant input rate. Alternatively, forexample, if one or more code blocks requires less than the nominalnumber of iterations, the output buffer can store those code blocks oncethey have been processed so as to preserve a constant output rate.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 depicts an exemplary iterative decoder and exemplary input andoutput buffers after initialization according to an exemplary embodimentof the present invention;

FIG. 2 depicts the exemplary iterative decoder and the exemplary inputand output buffers of FIG. 1 after using two hundred iterations for onecode block according to an exemplary embodiment of the presentinvention;

FIG. 3 depicts the exemplary iterative decoder and the exemplary inputand output buffers of FIG. 2 after an additional 200 iterations on onecode block have been performed according to an exemplary embodiment ofthe present invention; and

FIG. 4 depicts the exemplary iterative decoder and the exemplary inputand output buffers of FIG. 3 after two decode cycles have been completedaccording to an exemplary embodiment of the present invention.

It is further noted that the patent or application file contains atleast one drawing executed in color. Copies of this patent or patentapplication publication with color drawings will be provided by the U.S.Patent Office upon request and payment of the necessary fees.

DETAILED DESCRIPTION

For ease of illustration, the following description will assume a LowDensity Parity Code (“LDPC”) code is utilized in an exemplary decoder,it being understood that the systems and methods of the presentinvention can be applied to any iterative code, utilitzed in anyiterative decoder. Iterative codes, include, amongst other examples,LDPC codes, turbo codes, and variantions of those. Iterative algorithmsare understood to be decoding algorithms that utilize a variable numberof recursive steps, have some measure of convergence, and operate onblocks of data.

Simulations of certain LDPC codes, for example, have shown that anaverage of forty (40) iterations are required for decoding near thewaterfall region, but as many as several hundreds are occasionallyrequired to successfully converge. Because a decoder utilizing such anLDPC code seldom needs the full maximum number of iterations to convergeproperly, designing a decoder capable of supporting the maximumiterations on each code block can be highly inefficient, and in somecases may not even be possible. In exemplary embodiments of the presentinvention a more practical solution can be implemented. For example, adecoder can be designed with less than the maximum number of iterations,treating code blocks that need more iterations as special conditions. Inso doing, the complexity of the decoder can be greatly reduced. Sincesuch an exemplary decoder nominally uses less iterations than it iscapable of, there is a potential for the wasted iterations to be savedfor use on more difficult code blocks.

In order to handle code blocks that require more iterations, inexemplary embodiments of the present invention, a decoder can, forexample, be mated to elastic buffers at its input and output. Afterinitialization, for example, the output buffer can be assumed to berunning near capacity, and the input buffer can be assumed to be runningnear empty.

In exemplary embodiments of the present invention, each code blockhanded to the decoder can, for example, be processed using a maximumnumber of iterations, M, spanning multiple code blocks, where M can be,for example, a number far greater than the number of iterations thedecoder is capable of processing during the duration of one code blockin time, which is the nominal iteration count, N, of the decoder. Ingeneral, M can be, for example, an integer multiple of N. If the decoderutilizes more than such N nominal iterations, an elastic input buffercan, for example, begin to fill up, while an elastic output buffer canbegin to drain. Further code blocks may also be processed at more thanthe nominal number of iterations, as long as there is enough room leftin the input buffer to queue subsequent code blocks. Similarly, codeblocks requiring less than the nominal number of iterations of thedecoder can be processed using such a lesser number of iterations,provided that there is enough storage at the output buffer. This allowsthe datastream to propogate at a constant input and output rate throughthe decoder while the decoder processes individual code blocks atvariable iteration counts, and thus at variable rates. Eventually, thebuffers will reach their limit and the decoder will be limited toprocessing each code block at the nominal iteration count. However, ascode blocks are subsequently processed that require less than thenominal number of iterations, the buffers can begin to settle backtowards their initial state. Thus, in order to drain the input buffer itis necessary to process data faster than the fill rate of the buffer.If, as the result of such processing the input buffer becomes empty, thedecoder can then, for example, simply hold off processing any data untilthe next code block arrives.

In exemplary embodiments of the present invention, the sizes of theelastic buffers can, for example, be chosen based upon the generallyexpected number of consecutive code blocks that would need more than anominal number of iterations. For each such consecutive code block, thememory size can, for example, increase by a fixed number of code blocks,based on the ratio of maximum iterations to nominal iterations, whichcan be, for example, be kept to an integer relationship. In exemplaryembodiments of the present invention, control of the elastic bufferingcan be greatly simplified to a decision as to whether the decoder may ormay not use the maximum iterations. If there is not enough buffer spaceto use the full maximum iterations, then the decoder can, for example,resort to the nominal number of iterations. Or, for example, in aslightly more advanced approach, the precision can be limited to a codeblock boundary, choosing the buffer size as a multiple of a single codeblock. Decoding can then be permitted, for example, to use a multiple ofthe nominal iteration count, depending on how many code blocks can fitinto the remaining input buffer space. This latter option, can, forexample, allow for greater granularity in the allowed iterations.

To prevent wasted iterations on code blocks that would never converge,or may not need to, in exemplary embodiments of the present inventionmultiple techniques can be implemented to allow the decoder to exitearly (i.e., stop decoding the code block currently being processed).If, for example, a parity check indicates that a large portion of thebits of the currently processed code block are still in error after apre-defined number of iterations, it can be assumed, for example, thatthe code block will most likely fail. Thus, additional time need not bewasted on any additional iterations for that code block.

Another indicator of non-convergence that can be used, for example, is astatic parity error count. Sometimes a decoder can reach a certainparity error count and will not be able to get past it. On successiveiterations, the parity error count will either remain the same or hoverwithin a small delta in a varying, but non-converging cycle. Inexemplary embodiments of the present invention, if this conditionpersists for a pre-defined number of iterations, the decoder can, forexample, be assumed to be not likely to converge for that code block,and can, for example, exit early, which may not necessarily produce biterrors. In fact, this condition usually occurs as a result of weaklyprotected parity bits, after the information bits have alreadyconverged. Using a weak outer code, such as, for example, BCH, residualerrors in the data can be corrected. In exemplary embodiments of thepresent invention, depending on the correction ability of the outercode, an exemplary LDPC decoder can also exit early when the paritycount is below some minimum threshold. This can be done in realizationof the fact that an LDPC decoder can take several iterations trying tocompletely overcome the last few parity errors, sometimesunsuccessfully. If the parity sum gets below some minimum threshold, itis possible to exit early, relying on the outer code to correct anyerrors in the data. In general, the choice of such a threshold should bedone with care, since it is unknown how many actual bits are in errorrelative to an individual parity error. In each case, for example, theunused iterations can be saved and be applied to a more worthy codeblock, thus allowing the input buffer to drain and thus prevent it frombacking up unnecessarily.

FIGS. 1-4 illustrate the growth and reduction of exemplary elasticbuffers according to an exemplary embodiment of the present invention asadditional iterations are performed or as iterations less than thenominal number are deemed sufficient. Each slot in the buffers of FIGS.1-4 represents the size of a code block, where the lighter shading(light blue or white) represents an empty slot, and the darker shading(grey) represents an occupied slot. In the example depicted in FIGS. 1-4the nominal iteration count N is fifty; the buffer is thus designed sothat fifty iterations can be completed in the temporal duration of onecode block.

FIG. 1 depicts the buffer states after initialization, where the inputbuffer has one code block and the output buffer is full. FIG. 2 depictsthe buffer state if, for example, the next code block were to requiretwo hundred iterations, a factor of four times the nominal count. Withreference to FIG. 2, at the input one code block has been removed fordecoding, while four more have arrived, creating an increase of threecode blocks in the buffer relative to the input buffer's state asdepicted in FIG. 1. At the output, four code blocks leave the buffer tomaintain the constant output rate, while only one decoded block entersthe output buffer.

FIG. 3 illustrates the consequence of, for example, a second code blockalso requiring two hundred iterations. The input buffer is now nearcapacity and the output buffer is nearly depleted, thus limiting theallowable iterations for the next code block.

FIG. 4 illustrates the reduction in buffer size if, for example, thenext two code blocks only require half the nominal iteration count. Theinput buffer received only one additional code block, while the decoderconsumed two during a single code block duration, reducing the level byone block. Thus, only one code block left the output buffer, while twocode blocks have entered, leaving a surplus of one code block.

Thus, in exemplary embodiments of the present invention, a novel way toapproach ideal decoding performance, with the advantage of using a muchsimpler decoder architecture, can be implemented. Since input and outputbuffers are a natural part of any communications system, the additionalcontrol logic and memory requirements associated with the disclosedmethods do not add any significant expense. In fact, in exemplaryembodiments of the present invention, the benefits of allowing aniterative decoder to run at a much slower rate can far outweigh the costof providing elastic buffers.

As noted above, the methods of the present invention can be applied toany type of iterative decoding architecture, where the data rates areconstant and the maximum possible iterations are not easily met.

While the present invention has been described with reference to certainexemplary embodiments, it will be understood by those skilled in the artthat various changes may be made and equivalents may be substitutedwithout departing from the scope of the invention. In addition, manymodifications may be made to adapt a particular situation or material tothe teachings of the invention without departing from its scope.Therefore, it is intended that the invention not be limited to theparticular embodiment disclosed, but that the invention will include allembodiments falling within the scope of the appended claims.

1. A method of efficiently performing iterative decoding, comprising:setting a decoder to operate at a nominal iteration rate N; allowing thedecoder to increase or decrease the number of iterations when needed orfeasible; and storing a queue of code blocks in each of an elastic inputbuffer and an elastic output buffer, wherein the input rate of codeblocks to the input buffer and the out put rate of code blocks from theoutput buffer is constant, wherein the size of the elastic input bufferis a function of the expected number, Nseq, of sequential code blocksthat would require M iterations, and wherein the size of the elasticinput buffer is Nseq multiplied by the size of a code block multipliedby M/N, or Nseq*M/N*Block_size.
 2. The method of claim 1, wherein thedecoder can increase to a maximum number of iterations M.
 3. The methodof claim 2, wherein M is an integer multiple of N.
 4. The method ofclaim 1, wherein the decoder implements one of a Low Density ParityCode, a Turbo code and a modification of either of them.
 5. The methodof claim 1, wherein the size of the elastic output buffer is a functionof the expected number of sequential code blocks that can be processedwith less than N iterations.
 6. The method of claim 1, wherein if theelastic input buffer is filled, the decoder operates at no more than Niterations per code block.
 7. The method of claim 1, wherein the decodercan exit processing of a code block upon the detection of one of adefined set of termination indicators.
 8. The method of claim 7, whereinthe defined set of termination indicators include large portion of bitsstill in error after a defined number of iterations, static parity errorcount, and parity sum below a defined minimum threshold.
 9. A system forefficient iterative decoding, comprising: a decoder set to operate at anominal iteration rate N; and an elastic input buffer and an elasticoutput buffer each coupled to the decoder, wherein the input rate ofcode blocks to the input buffer and the out put rate of code blocks fromthe output buffer is constant, and wherein the size of the elastic inputbuffer is a function of the expected number, Nseq, of sequential codeblocks that would require M iterations, and wherein said size of theelastic input buffer is Nseq multiplied by the size of a code blockmultiplied by M/N, or Nseq*M/N*Block size.
 10. The system of claim 9,wherein in operation the decoder can increase or decrease the number ofiterations when needed or feasible.
 11. The system of claim 10, whereinif the elastic input buffer is filled, the decoder operates at no morethan N iterations per code block.
 12. The system of claim 9, wherein thedecoder implements one of a Low Density Parity Code, a Turbo code and amodification of one of them.
 13. The system of claim 9, wherein the sizeof the elastic output buffer is a function of the expected number ofsequential code blocks that can be processed with less than Niterations.
 14. The system of claim 9, wherein the decoder can exitprocessing of a code block upon the detection of one of a defined set oftermination indicators.
 15. The system of claim 9, wherein the decodercan increase to a maximum number of iterations M.
 16. The system ofclaim 15, where M is greater than or equal to 4N.
 17. A non-transitoryprogram storage device readable by a processing unit, tangibly embodyinga program of instructions executable by the processing unit to implementa method of efficiently performing iterative decoding, said methodcomprising: setting a decoder to operate at a nominal iteration rate N;increasing or decreasing the number of iterations when needed orfeasible; and storing a queue of code blocks in each of an elastic inputbuffer and an elastic output buffer, wherein the input rate of codeblocks to the input buffer and the out put rate of code blocks from theoutput buffer is constant, wherein the size of the elastic input bufferis a function of the expected number, Nseq, of sequential code blocksthat would require M iterations, and wherein the size of the elasticinput buffer is Nseq multiplied by the size of a code block multipliedby M/N, or Nseq*M/N*Block_size.
 18. The non-transitory programmablestorage device of claim 17, wherein in said method the decoder canincrease to a maximum number of iterations M.
 19. The non-transitoryprogrammable storage device of claim 17, wherein in said method M is aninteger multiple of N.
 20. The non-transitory programmable storagedevice of claim 17, wherein in said method the decoder implements one ofa Low Density Parity Code, a Turbo code and a modification of either ofthem.
 21. The non-transitory programmable storage device of claim 17,wherein in said method the size of the elastic output buffer is afunction of the expected number of sequential code blocks that can beprocessed with less than N iterations.
 22. The non-transitoryprogrammable storage device of claim 17, wherein in said method if theelastic input buffer is filled, the decoder operates at no more than Niterations per code block.
 23. The non-transitory programmable storagedevice of claim 17, wherein in said method the decoder can exitprocessing of a code block upon the detection of one of a defined set oftermination indicators.
 24. The non-transitory programmable storagedevice of claim 17, wherein in said method the defined set oftermination indicators include large portion of bits still in errorafter a defined number of iterations, static parity error count, andparity sum below a defined minimum threshold.